A comparison of deterministic and probabilistic optimization algorithms for nonsmooth simulation-based optimization
نویسندگان
چکیده
منابع مشابه
Hybrid Probabilistic Search Methods for Simulation Optimization
Discrete-event simulation based optimization is the process of finding the optimum design of a stochastic system when the performance measure(s) could only be estimated via simulation. Randomness in simulation outputs often challenges the correct selection of the optimum. We propose an algorithm that merges Ranking and Selection procedures with a large class of random search methods for continu...
متن کاملLocal structure and algorithms in nonsmooth optimization
Given a real δ, find stable real polynomials p and q such that the polynomial r(s) = (s − 2δs+ 1)p(s) + (s − 1)q(s) is also stable. (We call a polynomial p stable if its abscissa α(p) = max{Re s : p(s) = 0} is nonpositive.) Clearly the problem is unsolvable if δ = 1, since then r(1) = 0; more delicate results (summarized in [7]) show it remains unsolvable for δ < 1 close to 1. Blondel offered a...
متن کاملDeterministic and Probabilistic Optimization of Photonic Crystals
We propose to use a procedure based on three steps for the efficient synthesis of photonic crystal (PhC) structures: 1) Probabilistic optimization of the fundamental structure on a regular crystal lattice, 2) sensitivity analysis with respect to the lattice sites in the main area of the PhC device, and 3) deterministic optimization of the parameters of the most critical lattice sites. We outlin...
متن کاملSimulation-Based Optimization for Improving Hospital Performance
Background and Objectives: Nowadays health services affect a significant part of social, economic and political parts of each country. In this case, hospitals are considered as the important and final stage of health service supply chain. Consequently, quality of health services offered by hospitals has a straight impact on the safety of individuals. Methods: </st...
متن کاملA Framework for Adapting Population-Based and Heuristic Algorithms for Dynamic Optimization Problems
In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Building and Environment
سال: 2004
ISSN: 0360-1323
DOI: 10.1016/j.buildenv.2004.01.022